A class of Sudan-decodable codes
نویسنده
چکیده
In this correspondence, Sudan’s algorithm is modified into an efficient method to list-decode a class of codes which can be seen as a generalization of Reed–Solomon codes. The algorithm is specialized into a very efficient method for unique decoding. The code construction can be generalized based on algebraic-geometry codes and the decoding algorithms are generalized accordingly. Comparisons with Reed–Solomon and Hermitian codes are made.
منابع مشابه
Local Decoding and Testing for Homomorphisms
Locally decodable codes (LDCs) have played a central role in many recent results in theoretical computer science. The role of finite fields, and in particular, low-degree polynomials over finite fields, in the construction of these objects is well studied. However the role of group homomorphisms in the construction of such codes is not as widely studied. Here we initiate a systematic study of l...
متن کاملLow Rate Is Insufficient for Local Testability
Locally testable codes are error-correcting codes for which membership of a given word in the code can be tested probabilistically by examining it in very few locations. A linear code C ⊆ F2 is called sparse if dim(C) = O(log(n)). We say that a code C ⊆ F2 is -biased if all nonzero codewords of C have relative weight in the range ( 1 2 − , 1 2 + ), where may be a function of n. Kaufman and Suda...
متن کاملA Combination of Testability and Decodability by Tensor Products
Ben-Sasson and Sudan (RSA 2006) showed that repeated tensor products of linear codes with a very large distance are locally testable. Due to the requirement of a very large distance the associated tensor products could be applied only over sufficiently large fields. Then Meir (SICOMP 2009) used this result (as a black box) to present a combinatorial construction of locally testable codes that m...
متن کاملLimits on the Rate of Locally Testable Affine-Invariant Codes
Despite its many applications, to program checking, probabilistically checkable proofs, locally testable and locally decodable codes, and cryptography, “algebraic property testing” is not well-understood. A significant obstacle to a better understanding, was a lack of a concrete definition that abstracted known testable algebraic properties and reflected their testability. This obstacle was rem...
متن کاملA Class of Linear-Complexity, Soft-Decodable, High-Rate, “Good” Codes: Construction, Properties and Performance
A new class of high-rate, low-complexity and soft-decodable codes, named product accumulate codes, is proposed. The code structure, properties, thresholds and performance are investigated and it is shown that these codes are capable of near-capacity performance.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 46 شماره
صفحات -
تاریخ انتشار 2000